Space lower bounds for online pattern matching
نویسندگان
چکیده
منابع مشابه
Space Lower Bounds for Online Pattern Matching
We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position w...
متن کاملLower Bounds for Alternating Online Space Complexity
The notion of online space complexity, introduced by Karp in 1967, quantifies the amount of space required to solve a given problem using an online algorithm, represented by a Turing machine which scans the input exactly once from left to right. In this paper, we study alternating algorithms as introduced by Chandra, Kozen and Stockmeyer in 1976. We devise a lower bound technique relying on bou...
متن کاملLower Bounds for Online Algorithms
What is an oline problem Unlike the offline problems that we get the whole input at the beginning, in an online problem we just have some part of the input in advance. The rest of the input are queries that arrive one by one. Upon the arrival of each request, we need to process as it is received. In analyzing online algorithms, we usually, do not really care about the ruing time. The source of ...
متن کاملResolution Lower Bounds for Perfect Matching Principles
For an arbitrary hypergraph H, let PM(H) be the propositional formula asserting that H contains a perfect matching. We show that every resolution refutation of PM(H) must have size exp ( Ω ( δ(H) λ(H)r(H)(log n(H))(r(H) + log n(H)) )) , where n(H) is the number of vertices, δ(H) is the minimal degree of a vertex, r(H) is the maximal size of an edge, and λ(H) is the maximal number of edges incid...
متن کاملNew Lower Bounds for Matching Vector Codes
A Matching Vector (MV) family modulo m is a pair of ordered lists U = (u1, . . . , ut) and V = (v1, . . . , vt) where ui, vj ∈ Znm with the following inner product pattern: for any i, 〈ui, vi〉 = 0, and for any i 6= j, 〈ui, vj〉 6 = 0. A MV family is called q-restricted if inner products 〈ui, vj〉 take at most q different values. Our interest in MV families stems from their recent application in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.012